Generalizing from Diagrams
نویسنده
چکیده
This research is developing a computational model of the use of diagrams in the understanding of mathematical concepts. The model represents diagrams with a combination f pixel arrays and propositional descriptions. It applies a general simulation algorithm to the pixel representation to verify inferences, following the directions of a person attempting to demonstrate a theorem or conjecture of plane geometry. Such reasoning involves both spatial and verbal reasoning, and a major aspect of this research is to describe with computational precision how these modes interact. This paper addresses one important aspect of this problem, namely, how to represent general conclusions that are discovered by examination f a specific diagram. In other words, the question is how to represent quantification over classes of figures while retaining the use of inference by simulation that applies only to particular instances.
منابع مشابه
Knot Theory for Self-indexed Graphs
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs resulting from link diagrams have an additional structure, an integral flow. We call a self-indexed graph with integral flow a comte. The analogy with links...
متن کاملEffective Representation of Information: Generalizing Free Rides
In order to effectively communicate information, the choice of representation is important. Ideally, a representation will aid readers in making desired inferences. In this poster, we introduce the theory of observation: what it means for one statement to be observable from another. Using observability, we sketch a characterization of the observational advantages of one representation over anot...
متن کاملStraight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
We consider the question under which circumstances the straight skeleton and the Voronoi diagram of a given input shape coincide. More precisely, we investigate convex distance functions that stem from centrally symmetric convex polyhedra as unit balls and derive sufficient and necessary conditions for input shapes in order to obtain identical straight skeletons and Voronoi diagrams with respec...
متن کاملCrossings and Nestings in Tangled Diagrams
A tangled-diagram over [n] = {1, . . . , n} is a graph of degree less than two whose vertices 1, . . . , n are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Generalizing the construction of Chen et.al. we prove a bijection between generalized vacillating tableaux with less than k rows and knoncrossing tangled-di...
متن کاملRegularization of QED by a generalized ’t Hooft and Veltman method
Generalizing the ’t Hooft and Veltman method of unitary regulators, we demonstrate for the first time the existence of local, Lorentz-invariant, physically motivated Lagrangians of quantum-electrodynamic phenomena such that: (i) Feynman diagrams are finite and equal the diagrams of QED but with regularized propagators. (ii) N-point Green functions are causal. (iii) Smatrix relates only electron...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002